Nuprl Lemma : p-graph_wf2
11,40
postcript
pdf
A
:Type,
f
:(
A
(
A
+ Top)). p-graph(
A
;
f
)
A
A
latex
Definitions
Type
,
t
T
,
Top
,
left
+
right
,
x
:
A
B
(
x
)
,
Void
,
x
:
A
.
B
(
x
)
,
x
:
A
.
B
(
x
)
,
S
T
,
P
Q
,
do-apply(
f
;
x
)
,
s
=
t
,
suptype(
S
;
T
)
,
can-apply(
f
;
x
)
,
b
,
,
A
c
B
,
x
.
A
(
x
)
,
p-graph(
A
;
f
)
Lemmas
assert
wf
,
can-apply
wf
,
do-apply
wf
,
top
wf
origin
A:Type, f:(A
(A + Top)). p-graph(A;f) 
AA
A:Type, f:(A(A + Top)). p-graph(A;f) AA TB(x)
x:A.B(x)x:A. B(x)
T
Q
b
B
x.A(x)